北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2009, Vol. 32 ›› Issue (3): 50-54.doi: 10.13190/jbupt.200903.50.dengzhx

• 论文 • 上一篇    下一篇

Tanner图和积算法的伪码捕获及性能分析

邓志鑫 郝燕玲   

  1. 哈尔滨工程大学自动化学院
  • 收稿日期:2008-10-29 修回日期:2009-02-12 出版日期:2009-06-28 发布日期:2009-06-28
  • 通讯作者: 邓志鑫

PN Code Acquisition Sum-Product Algorithm and Performance Analysis Based on Tanner Graph

  • Received:2008-10-29 Revised:2009-02-12 Online:2009-06-28 Published:2009-06-28

摘要:

为了解决常规伪码捕获算法的捕获时间较长的问题,提出了一种基于Tanner图的伪随机码迭代捕获算法,给出了伪随机码的Tanner图表示和在该图上的和积算法流程,通过仿真的方法分析了迭代捕获算法的性能并对和积算法进行了改进,仿真结果表明该算法在信噪比不是很低的情况下,迭代捕获算法的最大后验估计误码率能够稳定收敛到零。

关键词: Tanner图, 和积算法, 伪随机码, 迭代捕获

Abstract:

To solve the problem of long acquisition time of routine PN code acquisition algorithm, a PN code iterative acquisition algorithm based on Tanner graph is proposed. The Tanner graph show of PN code and the sum-product algorithm process on the graph are presented. The performance of iterative acquisition algorithm is analyzed by simulation and the sum-product algorithm is modified. The simulation results show that when the signal-noise ratio is not very low, the bit-error rate of the APP estimation will convergence to zero.

Key words: Tanner graph, sum-product algorithm, PN code, iterative acquisition